UltraSPARCTM-I Emulation
نویسندگان
چکیده
The next generation UltraSPARC-I CPU represents a significant step forward in processor performance at the cost of increased design complexity. Added complexity increases the risks in achieving functionally correct first silicon. Existing design verification techniques were supplemented by applying emulation to obtain an early look at functionality. Discussed are the goals, methods and results of the UltraSPARC-I emulation.
منابع مشابه
From Rule-Breaking to ROM-Hacking: Theorizing the Computer Game-as-Commodity
This paper develops a theory of the game as a commodity form by looking at the unique practices of console hackers and videogame emulation communities. This theory argues for the necessity of understanding a game's system of rules in relation to the material conditions and constraints of the media within which it is constructed and distributed. After deriving the computer game-as-commodity from...
متن کاملLatch Divergency In Microprocessor Failure Analysis
This paper presents an approach for analysis of system state differences observable through the scan chain for the debug of functional failures. A novel methodology for Latch Divergence Analysis (LDA) is proposed for creating stable failure signatures and reducing system noise. The methodology and processing flow have been integrated into the normal debug flow for the UltraSPARCTM family proces...
متن کاملEmulation or Policy Convergence ? Potential Ambiguities in the Dyadic Event History Approach to State Policy Emulation
I demonstrate a source of bias in the common implementation of the dyadic event history model as applied to policy diffusion. This bias tends to severely overstate the extent to which policy changes depend on explicit emulation of other states rather than on a state’s internal characteristics. This happens because the standard implementation conflates policy emulation and policy adoption: since...
متن کاملExperiences with Synthetic Network Emulation for Complex IP based Networks
. . . . . . . . . . i Acknowledgments . . . . . . . . iii
متن کاملRandom gravitational emulation search algorithm (RGES (in scheduling traveling salesman problem
this article proposes a new algorithm for finding a good approximate set of non-dominated solutions for solving generalized traveling salesman problem. Random gravitational emulation search algorithm (RGES (is presented for solving traveling salesman problem. The algorithm based on random search concepts, and uses two parameters, speed and force of gravity in physics. The proposed algorithm is ...
متن کامل